Winner-Take-All Networks of O(N) Complexity
نویسندگان
چکیده
We have designed, fabricated, and tested a series of compact CMOS integrated circuits that realize the winner-take-all function. These analog, continuous-time circuits use only O(n) of interconnect to perform this function. We have also modified the winner-take-all circuit, realizing a circuit that computes local nonlinear inhibition. Two general types of inhibition mediate activity in neural systems: subtractive inhibition, which sets a zero level for the computation, and multiplicative (nonlinear) inhibition, which regulates the gain of the computation. We report a physical realization of general nonlinear inhibition in its extreme form, known as winner-take-all. We have designed and fabricated a series of compact, completely functional CMOS integrated circuits that realize the winner-take-all function, using the full analog nature of the medium. This circuit has been used successfully as a component in several VLSI sensory systems that perform auditory localization (Lazzaro and Mead, in press) and visual stereopsis (Mahowald and Delbruck, 1988). Winnertake-all circuits with over 170 inputs function correctly in these sensory systems. We have also modified this global winner-take-all circuit, realizing a circuit that computes local nonlinear inhibition. The circuit allows multiple winners in the network, and is well suited for use in systems that represent a feature space topographically and that process several features in parallel. We have designed, fabricated, and tested a CMOS integrated circuit that computes locally the winner-take-all function of spatially ordered input. THE WINNER-TAKE-ALL CIRCUIT Figure 1 is a schematic diagram of the winner-take-all circuit. A single wire, associated with the potential Vc, computes the inhibition for the entire circuit; for an n neuron circuit, this wire is O(n) long. To compute the global inhibition, each neuron k contributes a current onto this common wire, using transistor T2k . To apply this global inhibition locally, each neuron responds to the common wire voltage Vc, using transistor T1k . This computation is continuous in time; no clocks are used. The circuit exhibits no hysteresis, and operates with a time constant related to the size of the largest input. The output representation of the circuit is not binary; the winning output encodes the logarithm of its associated input. T11 T1n T21 T2n I1 In
منابع مشابه
Computational Tradeoffs in Biological Neural Networks: Self-Stabilizing Winner-Take-All Networks
We initiate a line of investigation into biological neural networks from an algorithmic perspective. We develop a simplified but biologically plausible model for distributed computation in stochastic spiking neural networks and study tradeoffs between computation time and network complexity in this model. Our aim is to abstract real neural networks in a way that, while not capturing all interes...
متن کاملDynamically-Adaptive Winner-Take-All Networks
Winner-Take-All (WTA) networks. in which inhibitory interconnections are used to determine the most highly-activated of a pool of unilS. are an important part of many neural network models. Unfortunately, convergence of normal WT A networks is extremely sensitive to the magnitudes of their weights, which must be hand-tuned and which generally only provide the right amount of inhibition across a...
متن کاملOn the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve competitive stages have so far been neglected in computational complexity theory, although they are widely used in computational brain models, artificial neural networks, and analog VLSI. Our theoretical analysis shows...
متن کاملA Fast Winner-Take-All Neural Networks With the Dynamic Ratio
In this paper, we propose a fast winner-take-all (WTA) neural network. The fast winner-take-all neural network with the dynamic ratio in mutual-inhibition is developed from the general mean-based neural network (GEMNET), which adopts the mean of the active neurons as the threshold of mutual inhibition. Furthermore, the other winner-take-all neural network enhances the convergence speed to becom...
متن کاملDesigns of Second-Order Associated Memory Networks with Threshold Logics: Winner-Take-All and Selective Voting
— The capacity of an order-d associative memory model is O(N d /logN) where N is the memory size in bit. In contrast, the capacity of the Hopfield network is limited to O(N/logN). Among higher order associative memory models (d > 1), the second order memory (d = 2) has attractive properties: a relatively small implementation cost of O(N 2), a small number of spurious states, and the presence of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988